Does computer-supported Math instruction makes students perceive them to be task-oriented and well-behaved? An experimental study
نویسندگان
چکیده
منابع مشابه
Computer-Supported Math Discourse Among Teachers and Students
This full research-and-development project designs, develops and tests an interrelated system of technological, pedagogical and analytic components to provide a range of opportunities for middleand high-school students to engage in significant mathematical discourse (DR K-12 challenge 2); it catalyzes and supports these opportunities by enhancing the ability of in-service teachers to engage in,...
متن کاملEffect of computer-based instruction on students’ functional task performance
This study was designated to examine the effectiveness of Computer-based intervention (CBI) on high school students’ reading performance and self-efficacy. Fifty high school students from 2 resource rooms were recruited. The students in the experimental group (CBI group) received training on the Kurzweil 3000 by the classroom teacher and the researcher and use the Kurzweil to do homework/course...
متن کاملTask Analysis Makes Is Methodologies Object Oriented
This paper proposes that the shift of ontological assumptions in systems analysis from the realist world to the socially constructing one could facilitate the smooth transition of object oriented analysis from a static view to a dynamic one in which object behaviour becomes a key to analysis. In order to realize the OOA of a dynamic view, this paper also proposes the integration of OOA with tas...
متن کاملDiscrete Math for Computer Science Students
ion The process of figuring out a general principle that explains why a certain computation makes sense is an example of the mathematical process of abstraction. We won’t try to give a precise definition of abstraction but rather point out examples of the process as we proceed. In a course in set theory, we would further abstract our work and derive the sum principle from the axioms of set theo...
متن کاملWell-behaved principles alternative to bounded induction
We introduce some Π1–expressible combinatorial principles which may be treated as axioms for some bounded arithmetic theories. The principles, denoted Sk(Σn, length log k) and Sk(Σn, depth log k) (where ‘Sk’ stands for ‘Skolem’), are related to the consistency of Σn–induction: for instance, they provide models for Σn–induction. However, the consistency is expressed indirectly, via the existence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2011
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2011.04.216